Efficient realisation of discrete Fourier transforms using the recursive discrete Hartley transform
نویسندگان
چکیده
منابع مشابه
Discrete Fractional Hartley and Fourier Transforms
This paper is concerned with the definitions of the discrete fractional Hartley transform (DFRHT) and the discrete fractional Fourier transform (DFRFT). First, the eigenvalues and eigenvectors of the discrete Fourier and Hartley transform matrices are investigated. Then, the results of the eigendecompositions of the transform matrices are used to define DFRHT and DFRFT. Also, an important relat...
متن کاملMultilayer Hadamard Decomposition of Discrete Hartley Transforms
Discrete transforms such as the discrete Fourier transform (DFT) or the discrete Hartley transform (DHT) furnish an indispensable tool in signal processing. The successful application of transform techniques relies on the existence of the so-called fast transforms. In this paper some fast algorithms are derived which meet the lower bound on the multiplicative complexity of the DFT/DHT. The appr...
متن کاملEfficient implementation of discrete cosine transform using recursive filter structure
In this paper, we generalize a formulation for converting a length-2'' discrete cosine transform into n groups of equations, then apply a novel technique for its implementation. The sizes of the groups are2n-i 2n-2 , . . . 2' respectively, while their structures are extremely regular. The realization can then be converted into recursive filter form, which is of particularly simple for practical...
متن کاملThe Discrete Fourier Transform∗
1 Motivation We want to numerically approximate coefficients in a Fourier series. The first step is to see how the trapezoidal rule applies when numerically computing the integral (2π) −1 2π 0 F (t)dt, where F (t) is a continuous, 2π-periodic function. Applying the trapezoidal rule with the stepsize taken to be h = 2π/n for some integer n ≥ 1 results in (2π) −1 2π 0 F (t)dt ≈ 1 n n−1 j=0 Y j , ...
متن کاملThe Discrete Fourier Transform
Disclaimer: These notes are intended to be an accessible introduction to the subject, with no pretense at completeness. In general, you can find more thorough discussions in Oppenheim's book. Please let me know if you find any typos. In this lecture, we discuss the Discrete Fourier Transform (DFT), which is a fourier representation for finite length signals. The main practical importance of thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEE Proceedings E Computers and Digital Techniques
سال: 1989
ISSN: 0143-7062
DOI: 10.1049/ip-e.1989.0035